The Implementation of a RandomizedPreprocessing Scheme for Nearest NeighborQueries
نویسندگان
چکیده
In this paper, we study the classical problem of preprocessing a set of points to answer nearest neighbor queries on a large spatial database, assuming a coarse grained parallel processor is available. We implement a known randomized prepro-cessing scheme which can answer these nearest neighbor queries very fast on such a machine. We present some practical performance results of our preliminary program on randomly generated data on a CM-5. Based on these preliminary testing results, we also discuss some options to speed up the preprocessing scheme when it is used in a real system.
منابع مشابه
On the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملThe Politico-Economic Challenges of Ghana’s National Health Insurance Scheme Implementation
Background National/social health insurance schemes have increasingly been seen in many low- and middle-income countries (LMICs) as a vehicle to universal health coverage (UHC) and a viable alternative funding mechanism for the health sector. Several countries, including Ghana, have thus introduced and implemented mandatory national health insurance schemes (NHIS) as part of reform efforts towa...
متن کاملAn Enhanced Technique for k - Nearest NeighborQueries with Non - spatial Selection
In multimedia databases, k-nearest neighbor queries are popular and frequently contain non-spatial predicates. Among the available techniques for such queries, the incremental nearest neighbor algorithm proposed by Hjaltason and Samet is known as the most useful algorithmm15]. The reason is that if k 0 > k neighbors are needed, it can provide the next neighbor for the upper operator without res...
متن کاملCosts and Benefits of Beef Cattle Fattening Schemes in some Selected Areas of North West Tanzania
This study highlights the costs and benefits of indigenous beef cattle fattening schemes in Shinyanga Urban and Kishapu Districts in Tanzania. Specifically, in this study the net profit (NP) for fatteners between beef cattle fattening schemes has been determined. The schemes were divided into two main categories, scheme 1 in which the animals were fed on cottonseed hulls (CSHL) based diets and ...
متن کاملA new CPA resistant software implementation for symmetric ciphers with smoothed power consumption: SIMON case study
In this paper we propose a new method for applying hiding countermeasure against CPA attacks. This method is for software implementation, based on smoothing power consumption of the device. This method is evaluated on the SIMON scheme as a case study; however, it is not relying on any specific SIMON features. Our new method includes only AND equivalent and XOR equivalent operations since every ...
متن کامل